Gaussian Integers and Arctangent Identities for Pi

نویسنده

  • JACK S. CALCUT
چکیده

utilize the x terms in Gregory’s series and have been instrumental in the calculation of decimal digits of π. Upon learning of these identities, one naturally desires an identity of the form π = r arctanx where r and x are rational and |x| < 1 is small. Such an identity would require only one evaluation of the arctangent function and this evaluation would converge quickly. However, identities of this form do not exist and this fact is not mentioned in the literature alongside lists of such multiple angle identities. The present note gives a very natural proof of this fact using a simple consequence of unique factorization of Gaussian integers (Main Lemma, Section 2). Section 3 gives several applications of the Main Lemma to arctangent identities, triangles, polygons on

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian Integers and Arctangent Identities for π

π = r arctan x where r and x are rational and |x | < 1 is small. Such an identity would require only one evaluation of the arctangent function and this evaluation would converge quickly. However, identities of this form do not exist and this fact is not mentioned in the literature alongside lists of such multiple-angle identities. The present article gives a very natural proof of this fact usin...

متن کامل

On a sequence related to the coprime integers

The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.

متن کامل

Security Systems Based on Gaussian Integers : Analysis of Basic Operations and Time Complexity of Secret Transformations

SECURITY SYSTEMS BASED ON GAUSSIAN INTEGERS: ANALYSIS OF BASIC OPERATIONS AND TIME COMPLEXITY OF SECRET TRANSFORMATIONS by Aleksey Koval Many security algorithms currently in use rely heavily on integer arithmetic modulo prime numbers. Gaussian integers can be used with most security algorithms that are formulated for real integers. The aim of this work is to study the benefits of common securi...

متن کامل

Efficient Arctangent Processor Design for the Frequency Offset Estimation of IEEE 802.11 Wireless LAN System

This paper presents a hardware design of an arctangent processor for the OFDM-based wireless LAN system. The arctangent processor is required in most OFDM-based communication system to estimate the frequency offset. The proposed arctangent processor does not require the division value of imaginary/real for the input argument, and uses these two values, respectively, to look up the tangent ROM t...

متن کامل

A Structure Theorem for Multiplicative Functions over the Gaussian Integers and Applications

We prove a structure theorem for multiplicative functions on the Gaussian integers, showing that every bounded multiplicative function on the Gaussian integers can be decomposed into a term which is approximately periodic and another which has a small U3-Gowers uniformity norm. We apply this to prove partition regularity results over the Gaussian integers for certain equations involving quadrat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008